Error-Trellis Construction for Tailbiting Convolutional Codes
نویسندگان
چکیده
Abstract—In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis is characterized by the condition that the syndrome former starts and ends in the same state. We clarify the correspondence between code subtrellises in the tailbiting code-trellis and error subtrellises in the tailbiting error-trellis. Also, we present a construction of tailbiting backward error-trellises. Moreover, we obtain the scalar parity-check matrix for a tailbiting convolutional code. The proposed construction is based on the adjointobvious realization of a syndrome former and its behavior is fully used in the discussion.
منابع مشابه
Study on methods of the trellis termination of the convolutional codes components of the turbo-codes
This paper makes a comparison in terms of the bit error rate (BER) and frame error rate (FER) versus signal to noise ratio (SNR) between the different methods of the trellis termination of the recursive, systematic, single and double-binary convolutional codes used in turbo-codes. The best four well known termination methods were investigated: circular (tailbiting), single-termination, interlea...
متن کاملMinimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction
Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n − 1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the p...
متن کاملConstruction for obtaining trellis run length limited error control codes from convolutional codes
Recently a new construction of run length limited block error control codes based on control matrices of linear block codes was proposed. In this paper a similar construction for obtaining trellis run length limited error control codes from convolutional codes is described. The main advantage of it, beyond its simplicity is that it does not require any additional redundancy except the one which...
متن کاملOn dualizing trellis-based APP decoding algorithms
The trellis of a finite Abelian group code is locally (i.e., trellis section by trellis section) related to the trellis of the corresponding dual group code which allows to express the basic operations of the a posteriori probability (APP) decoding algorithm (defined on a single trellis section of the primal trellis) in terms of the corresponding dual trellis section. Using this local approach,...
متن کاملPacket error rates of terminated and tailbiting convolutional codes
When a convolutional code is used to provide forward error correction for packet data transmission, the standard performance measures of convolutional codes, i.e., bit error rate and first-event error rate, become less useful. Instead we are interested in the average probability of block (or packet) error. In this paper a modified transfer function approach is used to obtain a union bound on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1201.4428 شماره
صفحات -
تاریخ انتشار 2012